基于循环频域滤波及Schmidt正交对消的单通道信号分离算法

单通道盲信号分离是信号处理领域中的研究热点和难点.分析了循环频域滤波用于单通道时频重叠信号分离的可行性,提出了基于循环平稳频移滤波器及Schmidt正交对消的信号分离方法.利用频移滤波器提取一个源信号,通过Schmidt正交化法从观测信号中消去已提取的源信号获得另一个源信号.仿真表明,本文算法可有效分离时频重叠的雷达通信信号,相比时域维纳滤波,分离性能提高了10dB以上.     

雷达干扰资源一对多分配方法

在对雷达干扰资源分配的一般优化模型和求解算法进行分析的基础上,从提高资源利用效率的角度出发,提出了目标雷达分群思想,并建立了一种新的基于一对多策略的雷达干扰资源分配模型,通过对目标雷达群的一对一分配实现对单部雷达的一对多分配.最后,对该模型中一些关键性问题进行了探讨,如任务整合、新任务参数确定、任务优先级排序、干扰机位置部署以及单目标雷达群干扰效益评估等.     

基于干涉仪测向的电子侦察卫星单星定位精度分析

针对信息化战场面临的复杂电磁环境,研究基于二维干涉仪测向方法的电子侦察卫星单星定位体制。分析了电子侦察卫星单星定位原理及定位算法,提出了电子侦察卫星单星测向定位精度GDOP算法,通过仿真定量计算卫星测角误差、卫星姿态误差和卫星位置误差对卫星定位精度的影响程度。结果表明电子侦察卫星测角精度、姿态控制精度和位置测量精度越高,单星定位精度越高。     

稳像式火控系统实车训练装置的研制

该训练装置可以在安装稳像式火控系统的坦克上完成射击基础练习的训练与考核.它以单片机为核心,在射击操作与实车相同的条件下,具有自动检靶,自动记录发射数、命中数,自动变换目标,自动报警,自动评定和显示成绩等功能.射手可独自在坦克内操作,自行开始练习,自我检查操作结果.     

基于PIC系列单片机的迫弹电子时间引信控制系统设计

介绍了迫弹电子时间引信控制系统的电路组成、工作原理及其功能,并以PIC16F873A型单片机作为控制器核心,对引信的工作过程进行控制,提高了引信的安全性和可靠性。     

Demand forecasting by temporal aggregation

Demand forecasting performance is subject to the uncertainty underlying the time series an organization is dealing with. There are many approaches that may be used to reduce uncertainty and thus to improve forecasting performance. One intuitively appealing such approach is to aggregate demand in lower‐frequency “time buckets.” The approach under concern is termed to as temporal aggregation, and in this article, we investigate its impact on forecasting performance. We assume that the nonaggregated demand follows either a moving average process of order one or a first‐order autoregressive process and a single exponential smoothing (SES) procedure is used to forecast demand. These demand processes are often encountered in practice and SES is one of the standard estimators used in industry. Theoretical mean‐squared error expressions are derived for the aggregated and nonaggregated demand to contrast the relevant forecasting performances. The theoretical analysis is supported by an extensive numerical investigation and experimentation with an empirical dataset. The results indicate that performance improvements achieved through the aggregation approach are a function of the aggregation level, the smoothing constant, and the process parameters. Valuable insights are offered to practitioners and the article closes with an agenda for further research in this area. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 479–498, 2013     

装备器材库温湿度监控系统的设计与实现

军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用Borland C++Builder语言对其组态软件进行程序设计.     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

一种改进固定单站无源定位模型性能分析

针对固定单站无源定位中的DPFRC算法无法对目标辐射源速度进行直接解算的问题,将多普勒频率引入观测量之中,提出一种改进的固定单站无源定位模型,并通过卡尔曼滤波对定位结果进行平滑处理。将改进模型与原有模型及另外一种可对速度进行直接解算的DDFRC模型进行了仿真比较,对不同距离、不同采样间隔和不同观测精度下3种模型的性能进行了仿真分析。仿真结果表明,相比于另外两种定位模型,改进模型具有更为广泛的应用环境和更好的鲁棒性。